Extensional Models of Untyped Lambda-mu Calculus
نویسندگان
چکیده
منابع مشابه
Extensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کاملExtensional Models of Typed Lambda-mu Calculus
This paper shows that the stream models of Nakazawa and Katsumata can be adapted to a typed setting for an extension of the Λμcalculus, called Λμcons. It shows the typed Λμcons is sound and complete with respect to the stream models. It also shows that any individual stream model with whole function spaces and infinite bases characterizes the extensional equality. This result corresponds to Fri...
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملInnocent game models of untyped lambda-calculus
This thesis is a detailed examination of the application of game semantics to constructing denotational models of the pure untyped λ-calculus. Game semantics is a fairly recent technique, using a formal setting for interaction to model sequential programming languages in an accurate way. We use a modification of the “innocent” games first used to give a fully-abstract syntax-independent model o...
متن کاملUntyped Lambda-Calculus with Input-Output
We introduce an untyped-calculus with input-output, based on Gordon's continuation-passing model of input-output. This calculus is intended to allow the classiication of possibly innnite input-output behaviors, such as those required for servers or distributed systems. We deene two terms to be operationally approximate ii they have similar behaviors in any context. We then deene a notion of app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.97.3